Simulation-based optimization over discrete sets with noisy constraints
نویسندگان
چکیده
منابع مشابه
Optimization via Simulation Over Discrete Decision Variables
Both the simulation research and software communities have been interested in optimization via simulation (OvS), by which we mean maximizing or minimizing the expected value of some output of a stochastic simulation. Continuous-decision-variable OvS, and gradient estimation to support it, has been an active research area with significant advances. However, the decision variables in many operati...
متن کاملDiscrete Optimization with Fuzzy Constraints
The primary benefit of fuzzy systems theory is to approximate system behavior where analytic functions or numerical relations do not exist. In this paper, heuristic fuzzy rules were used with the intention of improving the performance of optimization models, introducing experiential rules acquired from experts and utilizing recommendations. The aim of this paper was to define soft constraints u...
متن کاملQuantumlike Diffusion over Discrete Sets
In the present paper, a discrete differential calculus is introduced and used to describe dynamical systems over arbitrary graphs. The discretization of space and time allows the derivation of Heisenberg-like uncertainty inequalities and of a Schrödinger-like equation of motion, without need of any quantization procedure. Ever since the seminal work of Regge [1] on gravity, discretization has b...
متن کاملSimulation Optimization of Airline Delay with Constraints
Air traffic delay is a growing and expensive problem. We investigated ways to reduce the cost and magnitude of such delays by trading gate delays against more expensive air delays. Air management and planning at this level can be facilitated by simulation, especially for strategies that alter controls on the system. We used the SIMMOD air traffic simulation to model the system. The objective wa...
متن کامل2001: Constrained Optimization over Discrete Sets via Spsa with Application to Non-separable Resource Allocation
This paper presents a version of the Simultaneous Perturbation Stochastic Approximation (SPSA) algorithm for optimizing non-separable functions over discrete sets under given constraints. The primary motivation for discrete SPSA is to solve a class of resource allocation problems wherein the goal is to distribute a finite number of discrete resources to finitely many users in such a way as to o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IIE Transactions
سال: 2013
ISSN: 0740-817X,1545-8830
DOI: 10.1080/0740817x.2012.733580